Lagrangean Bounds and Lagrangean Heuristics for Just In Time Job-Shop Scheduling
نویسندگان
چکیده
We study the Job-Shop Scheduling problem with Earliness and Tardiness penalties. We describe two Lagrangean relaxations of the problem. The ̄rst one is based on the relaxation of precedence constraints while the second one is based on the relaxation of machine constraints. We introduce dedicated algorithms to solve the corresponding dual problems. The second one is solved by a simple dynamic programming algorithm while the ̄rst one requires the resolution of an NP-Hard problem by Branch and Bound. In both cases, the relaxations allow us to derive lower bounds as well as \Lagrangean" heuristic solutions. We ̄nally introduce a simple local search algorithm to improve the best solution found. Computational results show the e®ectiveness of our approach.
منابع مشابه
Improving Schedule Robustness via Stochastic Analysis and Dynamic Adaptation
We study methods that improve scheduling robustness under uncertain disturbances and dynamic shop conditions. A new method is proposed based on the notion of preprocessrst-schedule-later by Wu et al. [19]. Preprocessing starts at the beginning of the planning period where we use a Lagrangean Relaxation of the scheduling model to form networkstructured job subproblems. For each job subproblem we...
متن کاملAn integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملOn combinatorial auction and Lagrangean relaxation for distributed resource scheduling
Most existing methods for scheduling are based on centralized or hierarchical decision making using monolithic models. In this study, we investigate a new method based on a distributed and locally autonomous decision structure using the notion of combinatorial auction. In combinatorial auction the bidders demand a combination of dependent objects with a single bid. We show that not only can we ...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملA Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs
This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005